Improved Artificial Immune Algorithm and its application on the Permutation Flow Shop Sequencing Problems
نویسندگان
چکیده
منابع مشابه
Dominance properties for permutation flow shop problems
We are interested here in new sub cases for which permutation flow shop schedules are dominant while considering the classical flow shop scheduling problem and the makespan criterion. To obtain these sub cases, we introduce conditions on the lower and upper bounds of the processing times. These conditions can be quite realistic when the corresponding line is balanced.
متن کاملSelf-evolving Artificial Immune System via Developing T and B Cell for Permutation Flow-shop Scheduling Problems
Artificial Immune System is applied as a Heuristic Algorithm for decades. Nevertheless, many of these applications took advantage of the benefit of this algorithm but seldom proposed approaches for enhancing the efficiency. In this paper, a Self-evolving Artificial Immune System is proposed via developing the T and B cell in Immune System and built a self-evolving mechanism for the complexities...
متن کاملMILP Formulation and Genetic Algorithm for Non-permutation Flow Shop Scheduling Problem with Availability Constraints
In this paper, we consider a flow shop scheduling problem with availability constraints (FSSPAC) for the objective of minimizing the makespan. In such a problem, machines are not continuously available for processing jobs due to preventive maintenance activities. We proposed a mixed-integer linear programming (MILP) model for this problem which can generate non-permutation schedules. Furthermor...
متن کاملAn ant colony system for permutation flow-shop sequencing
Ant colony system (ACS) is a novel meta-heuristic inspired by the foraging behavior of real ant. This paper is the 2rst to apply ACS for the n=m=P=Cmax problem, an NP-hard sequencing problem which is used to 2nd a processing order of n di6erent jobs to be processed on m machines in the same sequence with minimizing the makespan. To verify the developed ACS algorithm, computational experiments a...
متن کاملContrasting Structured and Random Permutation Flow-Shop Scheduling Problems: Search-Space Topology and Algorithm Performance
The use of random test problems to evaluate algorithm performance raises an important, and generally unanswered, question: Are the results generalizable to more realistic problems? Researchers generally assume that algorithms with superior performance on diÆcult, random test problems will also perform well on more realistic, structured problems. Our research explores this assumption for the per...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Information Technology Journal
سال: 2007
ISSN: 1812-5638
DOI: 10.3923/itj.2007.929.933